package fun.coding.bfsdfs;

public interface BFS {

    public void findWordsInMatrix(char[][] chars);
    
     //Head to tail problem. 
    /* Given the word "HEAD" and the word "TAIL," write code and/or describe using computer science algorithms how you would transform from the word HEAD to the word TAIL. Each change must be by only one letter, you cannot change the letter in a given position twice, and each new word must be a valid word
     * */
}
